Falsifiable implies Learnable

نویسنده

  • David Balduzzi
چکیده

The paper demonstrates that falsifiability is fundamental to learning. We prove the following theorem for statistical learning and sequential prediction: If a theory is falsifiable then it is learnable – i.e. admits a strategy that predicts optimally. An analogous result is shown for universal induction. A theory that explains everything, [predicts] nothing. – attributed to Karl Popper. To what extent are theory-based predictions justified by prior observations? The question is known as the problem of induction and is fundamental to scientific inference. We address the problem of induction from the perspective of learning theory. That is, we consider which theories, and under what assumptions, can be applied to make optimal predictions. Our main result is that the more hypotheses a theory falsifies, suitably quantified, the closer the predictive performance of the best strategy (based on the theory) will be to the theory's post hoc explanatory performance on observed data. Learning theorists have characterized the generalization performance of algorithms in a wide range of scenarios. Although none of these scenarios adequately captures the practice of scientific inference, they form a family of minimal models of prediction. An intuitive understanding of the main results of learning theory therefore belongs in every scientist's conceptual toolkit. Unfortunately, the results are phrased in opaque terminology that depends on specialized concepts such as Rademacher complexity, shattering coefficients and VC-dimensions. This paper presents basic results from learning theory in terminology that is meaningful to the broader scientific community. The results cover three scenarios. In each scenario, Forecaster uses a theory (or theories) to predict Nature's next move(s) based on Nature's previous moves. The paper develops the following account. A. The risk. — The risk of a theory is how accurately it explains a sequence of events. A theory explains a sequence of events perfectly if it contains a predictor that correctly labels every element. In general, the accuracy of an explanation is the fraction of the sequence that its best predictor explains correctly. — The risk of a strategy is how accurately it predicts a sequence of events. A strategy specifies picks a predictor based on previously observed events, which it then applies to future events. The strategy's predictive accuracy is the fraction of

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Representing Knowledge in Learning Systems by Pseudo Boolean Functions

Concepts that can be expressed as solutions to multilinear pseudo boolean equations with a bounded degree are shown to be learnable in polynomial time from positive examples. This implies the leamability from positive examples of many families of boolean formulae by a unified algorithm. Some of these formulae were not previously known to be learnable, and some were known to be learnable by diff...

متن کامل

Learning from Partial Observations

We present a general machine learning framework for modelling the phenomenon of missing information in data. We propose a masking process model to capture the stochastic nature of information loss. Learning in this context is employed as a means to recover as much of the missing information as is recoverable. We extend the Probably Approximately Correct semantics to the case of learning from pa...

متن کامل

Resource-bounded Dimension in Computational Learning Theory

This paper focuses on the relation between computational learning theory and resource-bounded dimension. We intend to establish close connections between the learnability/nonlearnability of a concept class and its corresponding size in terms of effective dimension, which will allow the use of powerful dimension techniques in computational learning and viceversa, the import of learning results i...

متن کامل

On White-box Cryptography and Obfuscation

We study the relationship between obfuscation and white-box cryptography. We capture the requirements of any white-box primitive using a White-Box Property (WBP) and give some negative/positive results. Loosely speaking, the WBP is defined for some scheme and a security notion (we call the pair a specification), and implies that w.r.t. the specification, an obfuscation does not leak any “useful...

متن کامل

Integrated Process Planning and Active Scheduling in a Supply Chain-A Learnable Architecture Approach

Through the lens of supply chain management, integrating process planning decisions and scheduling plans becomes an issue of great challenge and importance. Dealing with the problem paves the way to devising operation schedules with minimum makespan; considering the flexible process sequences, it can be viewed as a fundamental tool for achieving the scheme, too. To deal with this integration, t...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:
  • CoRR

دوره abs/1408.6618  شماره 

صفحات  -

تاریخ انتشار 2014